Convexity in tandem queues
نویسنده
چکیده
We derive convexity results and related properties for the value functions of tandem queueing systems. The results for standard multi-server queues are new. For completeness we also prove and generalize existing results on tandems of controllable queues. The results can be used to compare queueing systems. This is done for systems with and without batch arrivals, and for systems with different numbers of on-off sources.
منابع مشابه
A Note on Convexity of the Expected Delay Cost in Single-Server Queues
In this note we show with an analytical counterexample that the expected delay cost for a G/G/1 queue is not necessarily convex in the arrival rate as sometimes claimed in the literature. We can prove, however, that the total expected delay cost rate is convex in the arrival rate. This cost rate is often of interest when designing queueing systems. Mathematics: Convexity. This note shows that t...
متن کاملConvexity and Optimal Load Distributions in Work Conserving */*/1 Queues
In this paper we develop fundamental convexity properties of unfinished work and packet waiting time in a work conserving */*/1 queue. The queue input consists of an uncontrollable background process and a rate-controllable input stream. We show that any moment of unfinished work is a convex function of the controllable input rate. The convexity properties are then extended to address the probl...
متن کاملInterpolation approximations for queues in series
Tandem queues constitute a fundamental structure of queueing networks. However, exact queue times in tandem queues are notoriously difficult to compute except for some special cases. Several approximation schemes that are based on mathematical assumptions that enable approximate analyses of tandem queues have been reported in the literature. This article proposes an approximation approach that ...
متن کاملDuality and Equivalencies in Closed Tandem Queueing Networks
Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we s...
متن کاملAnalysis and Approximation of Dual Tandem Queues with Finite Buffer Capacity
Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through the insight from Friedman's reduction method. Fundamental properties of tandem queues with finite buffer capacity are examined. We show that in general system service rate of a dual tan...
متن کامل